Probabilistic quantifiers and games
نویسندگان
چکیده
منابع مشابه
Probabilistic Quantifiers and Games
We consider inclusion relations among a multitude of classical complexity classes and classes with probabilistic components. A key tool is a method for characterizing such classes in terms of the ordinary quantifiers 3 and V together with a quantifier 3+, which means roughly “for most,” applied to polynomial-time predicates. This approach yields a uniform treatment which leads to easier proofs ...
متن کاملQuerying with Vague Quantifiers Using Probabilistic Semantics
Many realistic scenarios call for answers to questions involving vague expressions like almost all, about half, or at least about a third. We present a modular extension of classical first-order queries over relational databases, with binary, proportional, semi-fuzzy quantifiers modeling such expressions via random sampling. The extended query language has an intuitive semantics and allows one ...
متن کاملProbabilistic Games
Assume we have the following game. A verifier V interacts with two provers P1 and P2. The verifier is probabilistic and acts honestly according to its (known) strategy. The goal of the provers is to convince the verifier of a certain fact. The provers may collaborate to set up a strategy to maximize their chances of success. However, they are not allowed to exchange information once they receiv...
متن کاملProbabilistic Robust Timed Games
Solving games played on timed automata is a well-known problem and has led to tools and industrial case studies. In these games, the first player (Controller) chooses delays and actions and the second player (Perturbator) resolves the non-determinism of actions. However, the model of timed automata suffers from mathematical idealizations such as infinite precision of clocks and instantaneous sy...
متن کاملSolving Probabilistic Combinatorial Games
Probabilistic combinatorial games (PCG) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal position in each subgame are evaluated by a probability distribution. The distribution expresses the uncertainty in the local evaluation. This paper focuses on the analysis and solution methods for a special case, 1-level binary PCG. M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1988
ISSN: 0022-0000
DOI: 10.1016/0022-0000(88)90037-2